A decidable fragment of predicate calculus

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Calculus Of Constituents - A Decidable Fragment Of Second Order PL

We present a short review of the calculus of constituents.

متن کامل

Decidable Reasoning in a Fragment of the Epistemic Situation Calculus

The situation calculus is a popular formalism for reasoning about actions and change. Since the language is first-order, reasoning in the situation calculus is undecidable in general. An important question then is how to weaken reasoning in a principled way to guarantee decidability. Existing approaches either drastically limit the representation of the action theory or neglect important aspect...

متن کامل

A Hybrid Predicate Calculus∗

We present the Hybrid Predicate Calculus (HPC), a hybrid logical system which incorporates a fairly conventional first-order predicate calculus, but which also include elements of modal logic and relational algebra. A special effort has been made to produce a (syntactically and semantically) well-integrated whole, rather than just a disjoint union. Our calculus, from a formal point of view, is ...

متن کامل

What Makes Atl* Decidable? A Decidable Fragment of Strategy Logic

Strategy Logic (SL, for short) has been recently introduced by Mogavero, Murano, and Vardi as a formalism for reasoning explicitly about strategies, as first-order objects, in multi-agent concurrent games. This logic turns out to be very powerful, strictly subsuming all major previously studied modal logics for strategic reasoning, including ATL, ATL∗, and the like. The price that one has to pa...

متن کامل

A calculus for a decidable fragment of hybrid logic with binders

In this paper we provide the first (as far as we know) direct calculus deciding satisfiability of formulae in negation normal form in the fragment of hybrid logic with the satisfaction operator and the binder, where no binder dominates any occurrence of the 2 operator. A preliminary transformation of formulae into equisatisfiable ones turns the calculus into a satisfiability decision procedure ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 1984

ISSN: 0304-3975

DOI: 10.1016/0304-3975(84)90047-1